Kinetic Investigation of Small Systems Using Different Algorithms

نویسندگان

  • F. Taherkhani
  • G. A. Parsafar
چکیده

To investigate the kinetics of small systems, the use of a stochastic approach is necessary. The classical approach to chemical kinetics is called a deterministic approach, since once the state of the system is known at time t1, its state at any other time will be known and no fluctuation about this value is observed [1,6]. The stochastic approach uses the inherent random nature of microscopic molecular collision to build a probabilistic model for a chemical reaction. This approach is useful in studying the kinetics of small systems. For small systems the validity of the deterministic approach becomes worse [1-7]. The calculated average concentration vs. time given by a stochastic approach and deterministic approach for a linear system are found to be equal. However, the results of these two approaches for nonlinear small systems are completely different [4]. The stochastic formulation proceeds by considering the grand probability function P(X;t), the density probability of particles in volume V at time t, where Xi is the number of Si

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kinetic Mechanism Reduction Using Genetic Algorithms, Case Study on H2/O2 Reaction

For large and complex reacting systems, computational efficiency becomes a critical issue in process simulation, optimization and model-based control. Mechanism simplification is often a necessity to improve computational speed. We present a novel approach to simplification of reaction networks that formulates the model reduction problem as an optimization problem and solves it using geneti...

متن کامل

Two new heuristic algorithms for Covering Tour Problem

Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...

متن کامل

Addressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics

In most real world application and problems, a homogeneous product is carried from an origin to a destination by using different transportation modes (e.g., road, air, rail and water). This paper investigates a fixed charge transportation problem (FCTP), in which there are different routes with different capacities between suppliers and customers. To solve such a NP-hard problem, four meta-heur...

متن کامل

Dose Calculations for Lung Inhomogeneity in High-Energy Photon Beams and Small Beamlets: A Comparison between XiO and TiGRT Treatment Planning Systems and MCNPX Monte Carlo Code

Introduction Radiotherapy with small fields is used widely in newly developed techniques. Additionally, dose calculation accuracy of treatment planning systems in small fields plays a crucial role in treatment outcome. In the present study, dose calculation accuracy of two commercial treatment planning systems was evaluated against Monte Carlo method. Materials and Methods Siemens Once or linea...

متن کامل

Back-flashover Investigation of HV Transmission Lines Using Transient Modeling of the Grounding Systems

The article presents the transients analysis of the substation grounding systems and transmission line tower footing resistances which can affect to the back-flashover (BF) or overvoltage across insulator chain in an HV power systems by using EMTP-RV software. The related transient modeling of the grounding systems is based on a transmission line (TL) model with considering the soil ionization....

متن کامل

Scheduling Problem of Virtual Cellular Manufacturing Systems (VCMS); Using Simulated Annealing and Genetic Algorithm based Heuristics

In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006